public class Test18 {
    public int maxProfit(int k, int[] prices) {
        int n = prices.length;
        k = Math.min(k,n / 2);
        int MIN = -0x3f3f3f3f;
        int[][] f = new int[n][k + 1];
        int[][] g = new int[n][k + 1];

        for(int i = 0;i <= k;i++) f[0][i] = g[0][i] = MIN;
        f[0][0] = -prices[0];
        g[0][0] = 0;

        for(int i = 1;i < n;i++) {
            for(int j = 0;j <= k;j++) {
                f[i][j] = Math.max(f[i - 1][j],g[i - 1][j] - prices[i]);
                g[i][j] = g[i - 1][j];
                if(j - 1 >= 0) g[i][j] = Math.max(g[i][j],f[i - 1][j - 1] + prices[i]);
            }
        }
        int maxPrices = 0;
        for(int i = 0;i <= k;i++) {
            maxPrices = Math.max(maxPrices,g[n - 1][i]);
        }
        return maxPrices;
    }
}
